Hierarchical Parallel Evaluation of a Hamming Code

نویسندگان

  • Shmuel Tomi Klein
  • Dana Shapira
چکیده

The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding log n parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of n processors in log n layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

متن کامل

Hamming Color Code for Dense and Robust One-shot 3D Scanning

We propose a novel color code, Hamming color code, designed for rapid 3D shape acquisition using structured light projection. The Hamming color code has several properties which are desirable for practical 3D acquisition as follows. First, the Hamming distance of adjacent colors is always 1, which makes the color detection robust to color blending due to defocusing, subsurface scattering, or ch...

متن کامل

Solving New Product Selection Problem by a New Hierarchical Group Decision-making Approach with Hesitant Fuzzy Setting

Selecting the most suitable alternative under uncertainty is considered as a critical decision-making problem that affects the success of organizations. In the selection process, there are a number of assessment criteria, considered by a group of decision makers, which often could be established in a multi-level hierarchy structure. The aim of this paper is to introduce a new hierarchical multi...

متن کامل

A Reconfigurable Parallel Signature Analyzer for Concurrent Error Correction in DRAM

An efficient strategy to utilize a parallel signature analyzer (PSA) for concurrent soft-error correction in DRAM’S is described. For a two-level w-bit, n-word memory system, the proposed technique needs only one additional chip as opposed to log, w + 2 in the conventional Hamming code. Such an error-correction circuit (ECC) significantly improves the reliability of the memory system.

متن کامل

Revisiting the Calculation of the Effective Free Distance of Turbo Codes

Introduction: Several authors [1, 2] have agreed that the performance of turbo codes [3] at the error floor region is largely determined by the weight-2 input minimum distance, which corresponds to the minimum Hamming weight among all codeword sequences generated by input sequences of weight two. If a turbo code T consists of N parallel concatenated convolutional codes separated by uniform inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Algorithms

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2017